Simplified error bounds for turning point expansions
نویسندگان
چکیده
منابع مشابه
Parabolic Cylinder Functions:Examples of Error Bounds For Asymptotic Expansions
Several asymptotic expansions of parabolic cylinder functions are discussed and error bounds for remainders in the expansions are presented. In particular Poincaré-type expansions for large values of the argument z and uniform expansions for large values of the parameter are considered. The expansions are based on those given in [5] and on modifications of these expansions given in [9]. Compute...
متن کاملError bounds on complex floating-point multiplication
Given floating-point arithmetic with t-digit base-β significands in which all arithmetic operations are performed as if calculated to infinite precision and rounded to a nearest representable value, we prove that the product of complex values z0 and z1 can be computed with maximum absolute error |z0| |z1| 12β √ 5. In particular, this provides relative error bounds of 2−24 √ 5 and 2−53 √ 5 for I...
متن کاملImproved Error Bounds for Floating-Point Products and Horner’s Scheme
Let u denote the relative rounding error of some floating-point format. Recently it has been shown that for a number of standard Wilkinson-type bounds the typical factors γk := ku/(1−ku) can be improved into ku, and that the bounds are valid without restriction on k. Problems include summation, dot products and thus matrix multiplication, residual bounds for LUand Cholesky-decomposition, and tr...
متن کاملImproved Error Bounds for Inner Products in Floating-Point Arithmetic
Given two floating-point vectors x, y of dimension n and assuming rounding to nearest, we show that if no underflow or overflow occurs, any evaluation order for inner product returns a floating-point number r̂ such that |r̂ − xT y| 6 nu|x|T |y| with u the unit roundoff. This result, which holds for any radix and with no restriction on n, can be seen as a generalization of a similar bound given in...
متن کاملA Verified Certificate Checker for Floating-Point Error Bounds
Being able to soundly estimate roundoff errors in floatingpoint computations is important for many applications in embedded systems and scientific computing. Due to the unintuitive nature of floatingpoint arithmetic, automated static analysis tools are highly valuable for this task. The results, however, are only as correct as the implementations of the static analysis tools. This paper present...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Analysis and Applications
سال: 2020
ISSN: 0219-5305,1793-6861
DOI: 10.1142/s0219530520500104